A universal data compression system

Trans. Inform. Theory, vol. IT-23, pp. 343-353, May 1977. [4] H. H. Tan, “Tree encoding of discrete-time abstract-alphabet stationary block-ergodic sources with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 671-681, Nov. 1976. [5] R. M. Gray, D. L. Net&off, and J. K. Omura, “Process definition of distortion-rate functions and source coding theorems,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 524-532, Sept. 1975. [6] T. Hashimoto, “A direct proof of the process definition of the distortion-rate function for stationary ergodic sources,” Inform. Contr., vol. 51, pp. 45-57, 1983. [7] T. Berger, Rate Distortion Theory.,, Englewood Cliffs, NJ: Prentice-Hall, 197 1. [8] F. Jelinek, “Tree encoding of memoryless time-discrete sources with a fidelity criterion,” IEEE Trans. Inform. Theov, vol. IT-15, pp. 584-590, Sept. 1969. [9] C. R. Davis and M. E. Hellman, “On tree coding with a fidelity criterion,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 373-378, July 1975. [lo] J. F. Flanagan, M. R. Schroeder, B. S. Atal, R. E. Crochiere, N. S. Jayant, and J. M. Tribdet, “Speech coding,” IEEE Trans. Commun., vol. COM-27, pp. 710-737, Apr. 1979. [1 1] J. B. Anderson and J. B. Bodie, “Tree encoding of speech,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 379-387, July 1975. [12] R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968. [13] J. K. Omura and A. ShEhara, “On convergence of symmetric sources,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 573-577, July 1973.